Analysis of Security Protocols using Finite-State Machines
نویسندگان
چکیده
منابع مشابه
Analysis of Security Protocols using Finite-State Machines
This paper demonstrates a comprehensive analysis method using formal methods such as finite-state machine. First, we describe the modified version of our new protocol and briefly explain the encrypt-then-authenticate mechanism, which is regarded as more a secure mechanism than the one used in our protocol. Then, we use a finite-state verification to study the behaviour of each machine created f...
متن کاملFinite-State Analysis of Security Protocols
Security protocols are notoriously di cult to design and debug. Even if the cryptographic primitives underlying a protocol are secure, unexpected interactions between parts of the protocol or several instances of the same protocol can lead to catastrophic security breaches. Since protocol attacks tend to be very subtle and hard to catch during the design and analysis process, some computer assi...
متن کاملEecient Finite-state Analysis for Large Security Protocols
We describe two state reduction techniques for nite-state models of security protocols. The techniques exploit certain protocol properties that we have identiied as characteristic of security protocols. We prove the soundness of the techniques by demonstrating that any violation of protocol invariants is preserved in the reduced state graph. In addition, we describe an optimization method for e...
متن کاملEfficient Finite-State Analysis for Large Security Protocols
We describe two state reduction techniques for nite-state models of security protocols. The techniques exploit certain protocol properties that we have identiied as characteristic of security protocols. We prove the soundness of the techniques by demonstrating that any violation of protocol invariants is preserved in the reduced state graph. In addition, we describe an optimization method for e...
متن کاملMarkovian analysis of large finite state machines
Regarding nite state machines as Markov chains facilitates the application of probabilistic methods to very large logic synthesis and formal veriication problems. In this paper we present symbolic algorithms to compute the steady-state probabilities for very large nite state machines (up to 10 27 states). These algorithms, based on Algebraic Decision Diagrams (ADDs) | an extension of BDDs that ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Advanced Research in Artificial Intelligence
سال: 2015
ISSN: 2165-4069,2165-4050
DOI: 10.14569/ijarai.2015.040407